Hints on proofs by recursion induction
نویسندگان
چکیده
منابع مشابه
Induction and Recursion on
This Dagstuhl-Seminar has been attended by 35 computer scientists, logicians, and mathematicians from 14 countries and 5 continents. Since the mid-1970's it had become clear that the calculus of relations is a fundamental conceptual and methodological tool in Computer Science just as much as in Mathematics. A number of seemingly distinct areas of research have in fact this much in common that t...
متن کاملInduction and Recursion on Datatypes
Since the mid-1970’s it had become clear that the calculus of relations is a fundamental conceptual and methodological tool in Computer Science just as much as in Mathematics. A number of seemingly distinct areas of research have in fact this much in common that their concepts and/or techniques come from the calculus of relations. However, it had also become clear that many opportunities for cr...
متن کاملInduction Proofs by Program Transformations
Unfold/fold transformations have been studied for various declarative programming languages such as functional languages [5, 12, 21], logic programming [14, 22, 23] and constraint logic programming [1, 8, 13]. Some of the most extensively studied transformation systems for logic programs are the unfold/fold transformation systems. At a high level, unfold and fold transformations for definite lo...
متن کاملAutomated Termination Proofs Using Walther Recursion
In this thesis, I present an improved method for automatic proofs of termination through a syntactic measurement of sizing that was first developed by Walther. We discuss formal requirements for proving termination using this method and how it can be generalized to other languages. We present a simple set-theoretic language as an example which can be used to write basic Lisp-like programs. Usin...
متن کاملSmall Induction Recursion
There are several different approaches to the theory of data types. At the simplest level, polynomials and containers give a theory of data types as free standing entities. At a second level of complexity, dependent polynomials and indexed containers handle more sophisticated data types in which the data have an associated indices which can be used to store important computational information. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1977
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/20.4.353